#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
using namespace std;

int T,n,m,a[1000006],x[5];


int main(){
    cin.tie(0);
    cout.tie(0);
    freopen("arena.in","r",stdin);
    freopen("arena.out","w",stdout);
    cin>>T;
    cin>>n>>m;
    for(int i=1;i<=n;i++){

    }
    while(T--){
        for(int i=0;i<4;i++)[
            cin>>x[i];
    }
	return 0;
}
